from math import factorial
n = int(input())
matrix = list()
for i in range(n):
matrix.append(input())
happiness_count = 0
for i in range(len(matrix)):
col_chocolate = 0
for j in range(len(matrix[i])):
if (matrix[i][j] == 'C'):
col_chocolate += 1
happiness_count += col_chocolate * (col_chocolate - 1) / (2 * 1)
for j in range(len(matrix[0])):
row_chocolate = 0
for i in range(len(matrix)):
if (matrix[i][j] == 'C'):
row_chocolate += 1
happiness_count += row_chocolate * (row_chocolate - 1) / (2 * 1)
print(int(happiness_count))
#include <bits/stdc++.h>
using namespace std;
string a[105];
int main()
{
int n, ans = 0;
cin >> n;
for(int i = 0; i < n; ++i)
{
cin >> a[i];
}
for(int i = 0; i < n; ++i)
{
int cnt = 0;
for(int j = 0; j < n; j++)
{
if(a[i][j] == 'C')
{
cnt++;
}
}
ans += (cnt - 1) * cnt / 2;
cnt = 0;
for(int j = 0; j < n; j++)
{
if(a[j][i] == 'C')
{
cnt++;
}
}
ans += (cnt - 1) * cnt / 2;
}
cout << ans << "\n";
return 0;
}
/* Thu Feb 09 2023 17:16:59 GMT+0300 (Moscow Standard Time) */
1629D - Peculiar Movie Preferences | 1629E - Grid Xor |
1629F1 - Game on Sum (Easy Version) | 2148. Count Elements With Strictly Smaller and Greater Elements |
2149. Rearrange Array Elements by Sign | 2150. Find All Lonely Numbers in the Array |
2151. Maximum Good People Based on Statements | 2144. Minimum Cost of Buying Candies With Discount |
Non empty subsets | 1630A - And Matching |
1630B - Range and Partition | 1630C - Paint the Middle |
1630D - Flipping Range | 1328A - Divisibility Problem |
339A - Helpful Maths | 4A - Watermelon |
476A - Dreamoon and Stairs | 1409A - Yet Another Two Integers Problem |
977A - Wrong Subtraction | 263A - Beautiful Matrix |
180C - Letter | 151A - Soft Drinking |
1352A - Sum of Round Numbers | 281A - Word Capitalization |
1646A - Square Counting | 266A - Stones on the Table |
61A - Ultra-Fast Mathematician | 148A - Insomnia cure |
1650A - Deletions of Two Adjacent Letters | 1512A - Spy Detected |